A Bucket-Based Approach to Query Rewriting Using Views in the Presence of Inclusion Dependencies
نویسندگان
چکیده
Manuscript received: 16 February 2005 Communicating Editor: Mirka Miller Copyright© 2006, Australian Computer Society Inc. General permission to republish, but not for profit, all or part of this material is granted, provided that the JRPIT copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Australian Computer Society Inc.
منابع مشابه
Query Rewriting in the Presence of Functional Dependencies with Lossless Join Decomposition
Query rewriting is an essential issue in data integration systems over the Web and has received considerable attention. Many rewriting algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the MiniCon algorithm, have been proposed to address this issue in the absence of functional dependencies. These algorithms can be divided into two categories: bucket-base...
متن کاملImproving View Selection in Query Rewriting Using Domain Semantics
Query rewriting using views is an important issue in data integration. Several algorithms have been proposed, such as the bucket algorithm, the inverse rules algorithm, the SVB algorithm, and the MiniCon algorithm. These algorithms can be divided into two categories. The algorithms of the first category are based on use of buckets while the ones of the second category are based on use of invers...
متن کاملScalable Query Reformulation Using Views in the Presence of Functional Dependencies
The problem of answering queries using views in data integration has recently received considerable attention. A number of algorithms, such as the bucket algorithm, the SVB algorithm, the MiniCon algorithm, and the inverse rules algorithm, have been proposed. However, integrity constraints, such as functional dependencies, have not been considered in these algorithms. Some efforts have been mad...
متن کاملQuery Answering using Views in the Presence of Dependencies
In this paper we investigate equivalent and maximally contained rewritings of a query using views under a set of dependencies. We propose two new algorithms that find equivalent and maximally contained rewritings in the presence of dependencies, and we also prove that a maximally contained rewriting computes all the certain answers under the open world assumption, both in the presence and the a...
متن کاملAn algorithm for answering queries efficiently using views
Algorithms for answering queries using views have been used in query planning to answer queries posed to knowledge bases, databases, and information systems. However, these algorithms do not scale well when the number of views increases. Three known algorithms, the bucket algorithm, the inverse-rules algorithm and an algorithm suggested by Leser have been used to reformulate queries before gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Research and Practice in Information Technology
دوره 38 شماره
صفحات -
تاریخ انتشار 2006